An effective method for solving multiple travelling salesman problem based on NSGA-II

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem

The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...

متن کامل

Fast Exact Method for Solving the Travelling Salesman Problem

Let apply this cutting procedure for ... 3 2 1 − − − → → N N N R R R sub-routes. One can readily see that there will be progressive increasing in the disturbances of sub-routes length, i.e. | ) ( ) ( | | ) ( ) ( | 1 1 − + − ≤ − k k k k R D R D R D R D , ,... 3 , 2 − − = N N k As result of application these transformations sequence, we should obtain N P r r r r R ∈ = 2 1 2 1 2 , }, , { sub-route...

متن کامل

An Approach for Solving Traveling Salesman Problem

In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...

متن کامل

Comparison between MOEA/D and NSGA-II on the Multiobjective Travelling Salesman Problem

Most multiobjective evolutionary algorithms are based on Pareto dominance for measuring the quality of solutions during their search, among them NSGA-II is well-known. A very few algorithms are based on decomposition and implicitly or explicitly try to optimize aggregations of the objectives. MOEA/D is a very recent such an algorithm. One of the major advantages of MOEA/D is that it is very eas...

متن کامل

Population-Based Optimization Algorithms for Solving the Travelling Salesman Problem

The Travelling Salesman Problem or the TSP is a representative of a large class of problems known as combinatorial optimization problems. In the ordinary form of the TSP, a map of cities is given to the salesman and he has to visit all the cities only once to complete a tour such that the length of the tour is the shortest among all possible tours for this map. The data consist of weights assig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Systems Science & Control Engineering

سال: 2019

ISSN: 2164-2583

DOI: 10.1080/21642583.2019.1674220